Nonlinear equality constraints in feasible sequential quadratic programming∗
نویسندگان
چکیده
منابع مشابه
Equality Constraints in FeasibleSequential Quadratic Programming
A simple scheme is proposed for handling nonlinear equality constraints in the context of a previously introduced sequential quadratic programming (SQP) algorithm for inequality constrained problems, generating iterates satisfying the constraints. The key is an idea due to Mayne and Polak (Math. Progr., vol. 11, pp. 67{80, 1976) by which nonlinear equality constraints are treated as \"-type con...
متن کاملSequential equality-constrained optimization for nonlinear programming
A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...
متن کاملSequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?
The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.
متن کاملA Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary imp...
متن کاملFeasible Sequential Quadratic Programming for Finely Discretized Problems from Sip
A Sequential Quadratic Programming algorithm designed to eeciently solve nonlinear optimization problems with many inequality constraints, e.g. problems arising from nely discretized Semi-Innnite Programming, is described and analyzed. The key features of the algorithm are (i) that only a few of the constraints are used in the QP sub-problems at each iteration, and (ii) that every iterate satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 1996
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556789608805638